Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds
نویسندگان
چکیده
We present an implementation of the Continued Fractions (CF) real root isolation method using a recently developed upper bound on the positive values of the roots of polynomials. Empirical results presented in this paper verify that this implementation makes the CF method always faster than the Vincent-Collins-Akritas bisection method, or any of its variants.
منابع مشابه
Improving the Performance of the Continued Fractions Method Using New Bounds of Positive Roots
Abstract. In this paper we compare four implementations of the Vincent-AkritasStrzeboński Continued Fractions (VAS-CF) real root isolation method using four different (two linear and two quadratic complexity) bounds on the values of the positive roots of polynomials. The quadratic complexity bounds were included to see if the quality of their estimates compensates for their quadratic complexity...
متن کاملOn the computing time of the continued fractions method
Algorithms for polynomial real root isolation are ubiquitous in computational real algebraic geometry but few lower bounds are known for their maximum computing time functions. One exception is the continued fractions method due to Vincent (1836) and recommended by Uspensky (1948). Collins and Akritas (1976) proved that the maximum computing time of the method is at least exponential in the len...
متن کاملIn-Depth Coverage of the Icon Programming Language and Applications Solving Square-Root Palindromes
In the last article on square-root palindromes [1], we investigated constant square-root palindromes (those in which all terms are the same) using a combination of programs, guesses, and deduction. In this article, we’ll take a different approach: solving continued fractions to get data from which to derive more information about square-root palindromes. In a previous article [2], we showed a m...
متن کاملlogcf: An Efficient Tool for Real Root Isolation
This paper revisits an algorithm for isolating real roots of univariate polynomials based on continued fractions. It follows the work of Vincent, Uspensky, Collins and Akritas, Johnson and Krandick. We use some tricks, especially a new algorithm for computing an upper bound of positive roots. In this way, the algorithm of isolating real roots is improved. The complexity of our method for comput...
متن کاملImplementation of Real Root Isolation Algorithms in Mathematica
In this paper we compare two real root isolation methods using Descartes’ Rule of Signs: the Interval Bisection method, and the Continued Fractions method. We present some time-saving improvements to both methods. Comparing computation times we conclude that the Continued Fractions method works much faster save for the case of very many very large roots.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007